Cyclic Haar graphs
نویسندگان
چکیده
For a given group with a generating set A a dipole with jAj parallel directed edges labeled by elements of A gives rise to a voltage graph whose covering graph denoted by H A is a bipartite regular graph called a bi Cayley graph In the case when is abelian we refer to H A as a Haar graph of with respect to the symbol A In particular for cyclic the above graph is referred to as a cyclic Haar graph A basic theory of cyclic Haar graphs is presented
منابع مشابه
Symmetries of Hexagonal Molecular Graphs on the Torus
Symmetric properties of some molecular graphs on the torus are studied. In particular we determine which cubic cyclic Haar graphs are 1-regular, which is equivalent to saying that their line graphs are 1 2-arc-transitive. Although these symmetries make all vertices and all edges indistinguishable , they imply intrinsic chirality of the corresponding molecular graph.
متن کاملVertex-transitive Haar graphs that are not Cayley graphs
In a recent paper (arXiv:1505.01475 ) Estélyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex-transitive but non-Cayley. The smallest example has 40 vertices and is the well-known Kronecker cover over the dodecahedron graph G(10, 2), occurring as the...
متن کاملOn a Cohen-lenstra Heuristic for Jacobians of Random Graphs
In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with duality pairing appears with frequency inversely proportional to the size of the group times the size of the group of automorphisms that preserve the pairing. We...
متن کاملUnsupervised Deep Haar Scattering on Graphs
The classification of high-dimensional data defined on graphs is particularly difficult when the graph geometry is unknown. We introduce a Haar scattering transform on graphs, which computes invariant signal descriptors. It is implemented with a deep cascade of additions, subtractions and absolute values, which iteratively compute orthogonal Haar wavelet transforms. Multiscale neighborhoods of ...
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 244 شماره
صفحات -
تاریخ انتشار 2002